Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs,
نویسندگان
چکیده
In the literature, there are quite a few algorithms to solve problems on distance-hereditary graphs. Two well-known graphs, trees and cographs, both belong to the class of distance-hereditary graphs. In this paper, we present an O(|V | + |E|)-time sequential algorithm to solve the Hamiltonian problem on a distance-hereditary graph G = (V, E). This algorithm is faster than the previous best result which takes O(|V | 2) time.
منابع مشابه
Hamiltonian Cycle Problem on Distance-Hereditary Graphs
All graphs considered in this paper are finite and undirected, without loops or multiple edges. Let G = (V, E) be a graph. Throughout this paper, let m and n denote the numbers of edges and vertices of graph G, respectively. A connected graph is distance-hereditary if the distance between every two vertices in a connected induced subgraph is the same as that in the original graph. Distance-here...
متن کاملGraph Classes between Parity and Distance-Hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs, are NP-complete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest an excessive gap between them. We introduce a family of classes forming an infinite lattice with re...
متن کاملLongest Path Problems on Ptolemaic Graphs
SUMMARY Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, there are few known graph classes such that the longest path problem can be solved efficiently. Polynomial time algorithms for finding a longest cycle and a longest path in a Ptolemaic graph are pr...
متن کاملLinear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs
We prove that claw-free graphs, containing an induced dominating path, have a Hamiltonian path, and that 2-connected claw-free graphs, containing an induced doubly dominating cycle or a pair of vertices such that there exist two internally disjoint induced dominating paths connecting them, have a Hamiltonian cycle. As a consequence, we obtain linear time algorithms for both problems if the inpu...
متن کاملWeighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs
Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted connected dominating set and a minimum vertex-weighted Steiner tree in a distance-hereditary graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 341 شماره
صفحات -
تاریخ انتشار 2005